Checking Admissibility Using Natural Dualities
نویسندگان
چکیده
منابع مشابه
Checking Admissibility in Finite Algebras
Checking if a quasiequation is admissible in a finite algebra is a decidable problem, but the naive approach, i.e., checking validity in the corresponding free algebra, is computationally unfeasible. We give an algorithm for obtaining smaller algebras to check admissibility and a range of examples to demonstrate the advantages of this approach.
متن کاملNatural Dualities in Partnership
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual side are structured Boolean spaces. Given a duality, one may ask when the topology can be swapped to the other side to yield a partner duality (or, better, a dual equivalence) between a category of topological algebras and a category of structures. A prototype for this procedure is provided by the...
متن کاملRegularising Natural Dualities
Given an algebra M we may adjoin an isolated zero to form an algebra M∞ satisfying all identities u ≈ v true in M for which u and v contain the same variables. Drawing on the structure theory of P lonka sums, we show that if M is a finite, dualisable algebra which is strongly irregular, then M∞ is also dualisable. Turning the construction of M∞ upside-down for the two-element left-zero band, we...
متن کاملNatural Dualities for Semilattice-based Algebras
While every finite lattice-based algebra is dualisable, the same is not true of semilattice-based algebras. We show that a finite semilattice-based algebra is dualisable if all its operations are compatible with the semilattice operation. We also give examples of infinite semilattice-based algebras that are dualisable. In contrast, we present a general condition that guarantees the inherent non...
متن کاملA Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the modal logic S4. Our method is based on a standard semantic ground tableau approach. In particular, we reduce rule admissibility in S4 to satisfiability of a formula in a logic that extends S4. The extended logic is charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2019
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3275115